Techniques for behavioral pairing in a task assignment system

ABSTRACT

Techniques for behavioral pairing in a task assignment system are disclosed. In one particular embodiment, the techniques may be realized as a method for behavioral pairing in a task assignment system comprising: determining, by at least one computer processor communicatively coupled to and configured to operate in the task assignment system, a priority for each of a plurality of tasks; determining, by the at least one computer processor, an agent available for assignment to any of the plurality of tasks; and assigning, by the at least one computer processor, a first task of the plurality of tasks to the agent using a task assignment strategy, wherein the first task has a lower-priority than a second task of the plurality of tasks.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 15/837,911, filed Dec. 11, 2017 (now U.S. Pat. No. 10,509,671), of which is hereby incorporated by reference in its entirety as if fully set forth herein.

FIELD OF THE DISCLOSURE

The present disclosure generally relates to behavioral pairing and, more particularly, to techniques for behavioral pairing in a task assignment system.

BACKGROUND OF THE DISCLOSURE

A typical task assignment system algorithmically assigns tasks arriving at the task assignment center to agents available to handle those tasks. At times, the task assignment system may have agents available and waiting for assignment to tasks. At other times, the task assignment center may have tasks waiting in one or more queues for an agent to become available for assignment.

In some typical task assignment centers, tasks are assigned to agents ordered based on time of arrival, and agents receive tasks ordered based on the time when those agents became available. This strategy may be referred to as a “first-in, first-out,” “FIFO,” or “round-robin” strategy. For example, in an “L2” environment, multiple tasks are waiting in a queue for assignment to an agent. When an agent becomes available, the task at the head of the queue would be selected for assignment to the agent.

Some task assignment systems prioritize some types of tasks ahead of other types of tasks. For example, some tasks may be high-priority tasks, while other tasks are low-priority tasks. Under a FIFO strategy, high-priority tasks will be assigned ahead of low-priority tasks. In some situations, some low-priority tasks may have a high average waiting time while high-priority tasks are handled instead. Moreover, agents that might have handled low-priority tasks more efficiently may end up being assigned to high-priority tasks instead, leading to suboptimal overall performance in the task assignment system.

In view of the foregoing, it may be understood that there may be a need for a system that efficiently optimizes the application of a BP strategy in L2 environments of a task assignment system.

SUMMARY OF THE DISCLOSURE

Techniques for behavioral pairing in a task assignment system are disclosed. In one particular embodiment, the techniques may be realized as a method for behavioral pairing in a task assignment system comprising determining, by at least one computer processor communicatively coupled to and configured to operate in the task assignment system, a priority for each of a plurality of tasks; determining, by the at least one computer processor, an agent available for assignment to any of the plurality of tasks; and assigning, by the at least one computer processor, a first task of the plurality of tasks to the agent using a task assignment strategy, wherein the first task has a lower-priority than a second task of the plurality of tasks.

In accordance with other aspects of this particular embodiment, the first plurality of tasks may comprise a number of tasks from a front of a queue of tasks.

In accordance with other aspects of this particular embodiment, the number of tasks is greater than one and less than ten.

In accordance with other aspects of this particular embodiment, the method may further comprise determining, by the at least one computer processor, an optimal degree of choice for the task assignment strategy, and determining, by the at least one computer processor, the number of tasks based on the optimal degree of choice.

In accordance with other aspects of this particular embodiment, the number of tasks may be proportional to a size of the queue of tasks.

In accordance with other aspects of this particular embodiment, the number of tasks may be proportional to relative numbers of tasks of different priorities.

In accordance with other aspects of this particular embodiment, the method may further comprise determining, by the at least one computer processor, that the first task of the plurality of tasks has exceeded a relevant service level agreement.

In accordance with other aspects of this particular embodiment, the service level agreement may be a function of an estimated wait time for the first task.

In accordance with other aspects of this particular embodiment, the first plurality of tasks may comprise a number of tasks from a front of a queue of tasks, and wherein the service level agreement may be a function of the number of tasks.

In accordance with other aspects of this particular embodiment, at least one of the plurality of tasks may be a virtual task.

In accordance with other aspects of this particular embodiment, the task assignment strategy may be a behavioral pairing strategy.

In another particular embodiment, the techniques may be realized as a system for behavioral pairing in a task assignment system comprising at least one computer processor communicatively coupled to and configured to operate in the task assignment system, wherein the at least one computer processor is further configured to perform the steps in the above-described method.

In another particular embodiment, the techniques may be realized as an article of manufacture for behavioral pairing in a task assignment system comprising a non-transitory processor readable medium and instructions stored on the medium, wherein the instructions are configured to be readable from the medium by at least one computer processor communicatively coupled to and configured to operate in the task assignment system and thereby cause the at least one computer processor to operate so as to perform the steps in the above-described method.

The present disclosure will now be described in more detail with reference to particular embodiments thereof as shown in the accompanying drawings. While the present disclosure is described below with reference to particular embodiments, it should be understood that the present disclosure is not limited thereto. Those of ordinary skill in the art having access to the teachings herein will recognize additional implementations, modifications, and embodiments, as well as other fields of use, which are within the scope of the present disclosure as described herein, and with respect to which the present disclosure may be of significant utility.

BRIEF DESCRIPTION OF THE DRAWINGS

To facilitate a fuller understanding of the present disclosure, reference is now made to the accompanying drawings, in which like elements are referenced with like numerals. These drawings should not be construed as limiting the present disclosure, but are intended to be illustrative only.

FIG. 1 shows a block diagram of a task assignment system according to embodiments of the present disclosure.

FIG. 2 shows a flow diagram of a task assignment method according to embodiments of the present disclosure.

DETAILED DESCRIPTION

A typical task assignment system algorithmically assigns tasks arriving at the task assignment center to agents available to handle those tasks. At times, the task assignment system may have agents available and waiting for assignment to tasks. At other times, the task assignment center may have tasks waiting in one or more queues for an agent to become available for assignment.

In some typical task assignment centers, tasks are assigned to agents ordered based on time of arrival, and agents receive tasks ordered based on the time when those agents became available. This strategy may be referred to as a “first-in, first-out,” “FIFO,” or “round-robin” strategy. For example, in an “L2” environment, multiple tasks are waiting in a queue for assignment to an agent. When an agent becomes available, the task at the head of the queue would be selected for assignment to the agent.

Some task assignment systems prioritize some types of tasks ahead of other types of tasks. For example, some tasks may be high-priority tasks, while other tasks are low-priority tasks. Under a FIFO strategy, high-priority tasks will be assigned ahead of low-priority tasks. In some situations, some low-priority tasks may have a high average waiting time while high-priority tasks are handled instead. Moreover, agents that might have handled low-priority tasks more efficiently may end up being assigned to high-priority tasks instead, leading to suboptimal overall performance in the task assignment system.

In view of the foregoing, it may be understood that there may be a need for a system that efficiently optimizes the application of a BP strategy in L2 environments of a task assignment system.

FIG. 1 shows a block diagram of a task assignment system 100 according to embodiments of the present disclosure. The description herein describes network elements, computers, and/or components of a system and method for benchmarking pairing strategies in a task assignment system that may include one or more modules. As used herein, the term “module” may be understood to refer to computing software, firmware, hardware, and/or various combinations thereof. Modules, however, are not to be interpreted as software which is not implemented on hardware, firmware, or recorded on a non-transitory processor readable recordable storage medium (i.e., modules are not software per se). It is noted that the modules are exemplary. The modules may be combined, integrated, separated, and/or duplicated to support various applications. Also, a function described herein as being performed at a particular module may be performed at one or more other modules and/or by one or more other devices instead of or in addition to the function performed at the particular module. Further, the modules may be implemented across multiple devices and/or other components local or remote to one another. Additionally, the modules may be moved from one device and added to another device, and/or may be included in both devices.

As shown in FIG. 1, the task assignment system 100 may include a task assignment module 110. The task assignment system 100 may include a switch or other type of routing hardware and software for helping to assign tasks among various agents, including queuing or switching components or other Internet-, cloud-, or network-based hardware or software solutions.

The task assignment module 110 may receive incoming tasks. In the example of FIG. 1, the task assignment system 100 receives m tasks over a given period, tasks 130A-130 m. Each of the m tasks may be assigned to an agent of the task assignment system 100 for servicing or other types of task processing. In the example of FIG. 1, n agents are available during the given period, agents 120A-120 n. m and n may be arbitrarily large finite integers greater than or equal to one. In a real-world task assignment system, such as a contact center, there may be dozens, hundreds, etc. of agents logged into the contact center to interact with contacts during a shift, and the contact center may receive dozens, hundreds, thousands, etc. of contacts (e.g., calls) during the shift.

In some embodiments, a task assignment strategy module 140 may be communicatively coupled to and/or configured to operate in the task assignment system 100. The task assignment strategy module 140 may implement one or more task assignment strategies (or “pairing strategies”) for assigning individual tasks to individual agents (e.g., pairing contacts with contact center agents).

A variety of different task assignment strategies may be devised and implemented by the task assignment strategy module 140. In some embodiments, a first-in/first-out (“FIFO”) strategy may be implemented in which, for example, the longest-waiting agent receives the next available task (in L1 environments) or the longest-waiting task is assigned to the next available task (in L2 environments). Other FIFO and FIFO-like strategies may make assignments without relying on information specific to individual tasks or individual agents.

In other embodiments, a performance-based routing (PBR) strategy may be used for prioritizing higher-performing agents for task assignment may be implemented. Under PBR, for example, the highest-performing agent among available agents receives the next available task. Other PBR and PBR-like strategies may make assignments using information about specific agents but without necessarily relying on information about specific tasks or agents.

In yet other embodiments, a behavioral pairing (BP) strategy may be used for optimally assigning tasks to agents using information about both specific tasks and specific agents. Various BP strategies may be used, such as a diagonal model BP strategy or a network flow BP strategy. These task assignment strategies and others are described in detail for the contact center context in, e.g., U.S. Pat. No. 9,300,802 and U.S. patent application Ser. No. 15/582,223, which are hereby incorporated by reference herein.

In some embodiments, a historical assignment module 150 may be communicatively coupled to and/or configured to operate in the task assignment system 100 via other modules such as the task assignment module 110 and/or the task assignment strategy module 140. The historical assignment module 150 may be responsible for various functions such as monitoring, storing, retrieving, and/or outputting information about agent task assignments that have already been made. For example, the historical assignment module 150 may monitor the task assignment module 110 to collect information about task assignments in a given period. Each record of a historical task assignment may include information such as an agent identifier, a task or task type identifier, outcome information, or a pairing strategy identifier (i.e., an identifier indicating whether a task assignment was made using a BP pairing strategy or some other pairing strategy such as a FIFO or PBR pairing strategy).

In some embodiments and for some contexts, additional information may be stored. For example, in a call center context, the historical assignment module 150 may also store information about the time a call started, the time a call ended, the phone number dialed, and the caller's phone number. For another example, in a dispatch center (e.g., “truck roll”) context, the historical assignment module 150 may also store information about the time a driver (i.e., field agent) departs from the dispatch center, the route recommended, the route taken, the estimated travel time, the actual travel time, the amount of time spent at the customer site handling the customer's task, etc.

In some embodiments, the historical assignment module 150 may generate a pairing model or similar computer processor-generate model based on a set of historical assignments for a period of time (e.g., the past week, the past month, the past year, etc.), which may be used by the task assignment strategy module 140 to make task assignment recommendations or instructions to the task assignment module 110. In other embodiments, the historical assignment module 150 may send historical assignment information to another module such as the task assignment strategy module 140 or the benchmarking module 160.

In some embodiments, a benchmarking module 160 may be communicatively coupled to and/or configured to operate in the task assignment system 100 via other modules such as the task assignment module 110 and/or the historical assignment module 150. The benchmarking module 160 may benchmark the relative performance of two or more pairing strategies (e.g., FIFO, PBR, BP, etc.) using historical assignment information, which may be received from, for example, the historical assignment module 150. In some embodiments, the benchmarking module 160 may perform other functions, such as establishing a benchmarking schedule for cycling among various pairing strategies, tracking cohorts (e.g., base and measurement groups of historical assignments), etc. The techniques for benchmarking and other functionality performed by the benchmarking module 160 for various task assignment strategies and various contexts are described in later sections throughout the present disclosure. Benchmarking is described in detail for the contact center context in, e.g., U.S. Pat. No. 9,712,676, which is hereby incorporated by reference herein.

In some embodiments, the benchmarking module 160 may output or otherwise report or use the relative performance measurements. The relative performance measurements may be used to assess the quality of the task assignment strategy to determine, for example, whether a different task assignment strategy (or a different pairing model) should be used, or to measure the overall performance (or performance gain) that was achieved within the task assignment system 100 while it was optimized or otherwise configured to use one task assignment strategy instead of another.

In some task assignment systems, a relatively large number of tasks can build up in a queue while waiting for assignment to agents as they become available. For this highly simplified example, there are nine tasks waiting in queue. Three of the tasks are high-priority tasks: H1, H2, and H3; and six of the tasks are low-priority tasks: L1, L2, L3, L4, L5, and L6.

In some task assignment systems, the tasks of different priorities may be organized (within the system, or at least conceptually) in different priority queues:

High-Priority Queue: H1, H2, H3

Low-Priority Queue: L1, L2, L3, L4, L5, L6

In this example, each priority queue is chronologically ordered according to the arrival time for each task (e.g., contact or caller in a contact center system). H1 is the longest-waiting high-priority task, H3 is the shortest-waiting high-priority task, L1 is the longest-waiting low-priority task, L6 is the shortest-waiting low-priority task, etc. In some embodiments, one or more of the tasks may be a “virtual task.” For example, in a call center context, a caller may request a callback and disconnect from the call center, but the caller's position and priority level is maintained in the queue.

In other task assignment systems, the tasks of different priorities may be intermingled (within the system, or at least conceptually) in a chronologically ordered queue, except that higher-priority tasks may be inserted in the queue ahead of lower-priority tasks:

Queue: H1, H2, H3, L1, L2, L3, L4, L5, L6

In this example, even if L1 is the longest-waiting task among all nine tasks, the three high-priority tasks that arrived later in time have been inserted into the queue ahead of L1.

A typical FIFO strategy may operate by assigning all of the high-priority tasks prior to assigning any of the low-priority tasks, allowing low-priority tasks to wait in the queue indefinitely, even as agents become available that may be able to handle lower-priority tasks more efficiently than higher-priority tasks. This shortcoming may be especially pernicious if higher-priority contacts continue arriving at the task assignment system.

In some task assignment systems, a service level agreement (SLA) may be in place that puts limits on how long any one task should be expected to wait for assignment. Some examples of SLAs include a fixed time (e.g., 10 seconds, 30 seconds, 3 minutes, etc.); an estimated wait time (EWT) plus some fixed time (e.g., an EWT of 1 min. 45 sec. plus 30 seconds); and a multiplier of EWT (e.g., 150% of EWT, or 1.2*EWT).

In these task assignment systems, a FIFO strategy may eventually assign some lower-priority tasks if the SLA is exceeded for that task (sometimes referred to a “blown SLA”). Nevertheless, low-priority tasks may still end up waiting in the queue for longer than average expected wait time, and agent assignments may still be made inefficiently.

In some embodiments, a more effective and efficient task assignment strategy is a BP strategy. Under a BP strategy, as many as all nine tasks may be considered for assignment when an agent becomes available. The BP strategy may still take the priority level of each task into account, but it may ultimately prefer to assign a lower-priority task ahead of a higher-priority task if information about the task and the available agent indicate that such a pairing is optimal for performance of the task assignment system and achieving a desired target task utilization or rate of assignment.

The extent to which a BP strategy may account for priority level is a spectrum. On one extreme end of the spectrum, a BP strategy may consider all tasks in queue (or all tasks in all priority queues), giving relatively little to no weight to each tasks' priority level:

Queue: T1, T2, T3, T4, T5, T6, T7, T8, T9

In this example, the BP strategy may be able to make efficient, optimal task assignments. However, one possible consequence of this strategy is that some high-priority tasks may end up waiting much longer than they would under a FIFO strategy as lower-priority tasks are assigned first

Near the other end of the spectrum, a BP strategy may consider all tasks in queue for the highest-priority level:

High-Priority Queue: H1, H2, H3

In this example, the BP strategy may still be able to make more efficient, optimal task assignments than the FIFO strategy. Under the FIFO strategy, the tasks would be assigned in queue order: first H1, then H2, and finally H3, regardless of which agent becomes available, whereas the BP strategy would consider information about the three tasks and the agent to select the more efficient pairing, even though the assigned high-priority task may not be the longest-waiting high-priority task. However, one possible consequence of this strategy is that low-priority tasks may end up waiting just as long as they would under the FIFO strategy, and opportunities to pair agents with low-priority tasks efficiently would be missed.

In some embodiments, a hybrid approach may be used that gives some deference to task prioritization and waiting time while also timely handling at least some of the longer-waiting lower-priority tasks. Some of these embodiments may be referred to as “Front-N” or “Head-N” because it considers the first N tasks in a prioritized queue.

For example, if N=6, such a BP strategy will select among the first six tasks in queue:

Queue: H1, H2, H3, L1, L2, L3, L4, L5, L6

In this example, when an agent become available, the BP strategy may assign any of the three high-priority tasks or any of the three longest-waiting low-priority tasks.

In some embodiments, N may be a predetermined and/or fixed value. In other embodiments, N may be dynamically determined for each pairing. For example, the BP strategy may determine a size for N that represents an optimal amount or degree of choice (e.g., 3, 6, 10, 20, etc.). For another example, N may be a function of the number of tasks waiting in the queue (e.g., one-quarter, -third, -half, etc. of the number of tasks in the queue). For another example, N may be a function of the relative number tasks at different priority levels.

For another example, the BP strategy may consider up to i calls for i≤N if it encounters an i-th call for which the SLA has already been blown. In this example, if L1 has already been waiting for longer than the SLA expects, the BP strategy may consider H1, H2, H3, and L1—disregarding L2 and L3 because it will prefer to pair the longer-waiting L1 before pairing L2 or L3.

In some embodiments, the BP strategy may use a SLA based on tracking how many times an individual task has been up for selection (i.e., how many times a task has appeared in the Front-N tasks):

1. H1(1), H2(1), H3(1), L1(1), L2(1), L3(1)=>H3 selected

2. H1(2), H2(2), L1(2), L2(2), L3(2), L4(1)=>L2 selected

3. H1(3), H2(3), L1(3), L3(3), L4(3), L5(1)=>H1 selected

4. H2(4), L1(4), L3(4), L5(2), L6(1)

If the SLA is based on whether a task has appeared in the Front-6 more than three times, there are now three tasks with blown SLAs by the fourth assignment: H2, L1, and L3 have now appeared for a fourth time. In these embodiments, the BP strategy may preferably pair these three tasks ahead of other tasks that have appeared in the Front-6 only three or fewer times (i.e., L5 and L6).

In some embodiments, the SLA based on Front-N may be a function of N. For example, a task may appear in the Front-N up to 1/2 NN, 2N, 5N, etc. before the SLA is blown. This type of SLA may be especially useful in real-world scenarios in which higher-priority tasks continue to arrive at the queue and would otherwise be assigned ahead of longer-waiting lower-priority tasks that have already appeared in the Front-N more than the Front-N SLA would normally expect or allow.

In some embodiments, individual tasks or types of tasks may have different SLAs from other tasks or other types of tasks. The different SLAs may be based on any of the techniques described above, such as time-based SLAs or SLAs based on the number of times an individual task has been included in the Front-N or otherwise evaluated. For example, the first task in the queue may have a SLA of 2N, whereas the second task in the queue may have a SLA of 3N. The determination of which SLA an individual task has may be based on information about the task, information about the available agent or agents, or both.

In some embodiments, the SLA for a task may be dynamic, changing as the amount of waiting time increases or the number of times the task has been evaluated in the Front-N increases.

FIG. 2 shows a task assignment method 200 according to embodiments of the present disclosure.

Task assignment method 200 may begin at block 210. At block 210, a number of tasks for a size of a plurality of tasks may be determined. In some embodiments, the number of tasks for the size of the plurality of tasks may be equivalent to a size of a queue of tasks. For example, in a contact center context, if twenty contacts are waiting in a queue for connection to an agent, the plurality of tasks would include all twenty contacts from the queue. In other embodiments, the number of tasks may be a fixed or predetermined number of tasks take from the front or head of the queue. For example, if the number of tasks is ten, the plurality of tasks may include the first ten tasks (e.g., contacts) from the queue of size twenty. In other embodiments, the number of tasks may be dynamically determined according to any of the techniques described above, such as a function (e.g., fraction, percentage, proportion) of the size of the queue, a function of a relative number of tasks for different priority levels, a function of a degree of choice for a behavioral pairing strategy, etc. In some embodiments, this number of tasks may be referred to as “N” and the plurality of tasks may be referred to as the “Front-N” plurality of tasks.

Task assignment method 200 may proceed to block 220. At block 220, a priority may be determined for each of the plurality of tasks (e.g., the Front-N tasks). For example, a first portion of the plurality of tasks may be designated as “high priority,” and a second portion of the plurality of tasks may be designated as “low priority.” In some embodiments, there may be an arbitrarily large number of different priorities and identifiers for priorities. In some embodiments, the task assignment system may maintain separate queues of tasks for each priority. In other embodiments, the task assignment system may maintain a single queue of tasks ordered first by priority and, in some cases, second by order of arrival time or another chronological ordering. In these embodiments, task assignment method 200 may consider all tasks or the Front-N tasks regardless of whether the tasks are maintained in a single prioritized queue or multiple priority queues.

Task assignment method 200 may proceed to block 230. In some embodiments, whether a SLA has been exceeded for at least one task of the plurality of tasks may be determined. In some embodiments, the task assignment strategy or the task assignment system will assign an agent to a task that has exceeded its SLA (e.g., the longest-waiting task with an exceeded or blown SLA). In various embodiments, the SLA may be defined or otherwise determined according to the any of the techniques described above, such as a fixed time, a function of EWT, or a function of the number of times a given task has been available for assignment in the Front-N. In other embodiments, there may be no SLA relevant to the task assignment strategy, and the task assignment method 200 may proceed without determining or otherwise checking for any exceeded SLAs.

Task assignment method 200 may proceed to block 240. At block 240, an agent may be determined that is available for assignment to any of the plurality of tasks. For example, in L2 environments, an agent becomes available for assignment. In other environments, such as L3 environments, multiple agents may be available for assignment.

Task assignment method 200 may proceed to block 250. At block 250, a task of the plurality of tasks may be assigned to the agent using the task assignment strategy. For example, if the task assignment strategy is a BP strategy, the BP strategy may consider information about each of the plurality of tasks and information about the agent to determine which task assignment is expected to optimize overall performance of the task assignment system. In some instances, the optimal assignment may be the longest-waiting, highest-priority task, as would be the case for a FIFO or PBR strategy. However, in other instances, the optimal assignment may be a longer-waiting and/or lower-priority task. Even if these instances, a lower expected performance for the instant pairing may be expected to lead to a higher overall performance of the task assignment system while also, in some embodiments, achieving a balanced or otherwise targeted task utilization (e.g., normalizing or balancing average waiting time for all tasks, or balancing average waiting time for all tasks within the same priority level).

In some embodiments, the task assignment strategy or the task assignment system may prioritize assigning a task with an exceeded SLA (such as a longest-waiting and/or highest-priority task with an exceeded SLA) if there is one.

In some embodiments, the task assignment system may cycle among multiple task assignment strategies (e.g., cycling between a BP strategy and FIFO or a PBR strategy). In some of these embodiments, the task assignment system may benchmark the relative performance of the multiple task assignment strategies.

After assigning the task to the agent, ask assignment method 200 may end.

At this point it should be noted that TK in accordance with the present disclosure as described above may involve the processing of input data and the generation of output data to some extent. This input data processing and output data generation may be implemented in hardware or software. For example, specific electronic components may be employed in a behavioral pairing module or similar or related circuitry for implementing the functions associated with TK in accordance with the present disclosure as described above. Alternatively, one or more processors operating in accordance with instructions may implement the functions associated with TK in accordance with the present disclosure as described above. If such is the case, it is within the scope of the present disclosure that such instructions may be stored on one or more non-transitory processor readable storage media (e.g., a magnetic disk or other storage medium), or transmitted to one or more processors via one or more signals embodied in one or more carrier waves.

The present disclosure is not to be limited in scope by the specific embodiments described herein. Indeed, other various embodiments of and modifications to the present disclosure, in addition to those described herein, will be apparent to those of ordinary skill in the art from the foregoing description and accompanying drawings. Thus, such other embodiments and modifications are intended to fall within the scope of the present disclosure. Further, although the present disclosure has been described herein in the context of at least one particular implementation in at least one particular environment for at least one particular purpose, those of ordinary skill in the art will recognize that its usefulness is not limited thereto and that the present disclosure may be beneficially implemented in any number of environments for any number of purposes. Accordingly, the claims set forth below should be construed in view of the full breadth and spirit of the present disclosure as described herein. 

1. A method for behavioral pairing in a task assignment system comprising: determining, by at least one computer processor communicatively coupled to and configured to operate in the task assignment system, a priority for each of a plurality of tasks; determining, by the at least one computer processor, an agent available for assignment to any of the plurality of tasks; and assigning, by the at least one computer processor, a first task of the plurality of tasks to the agent using a task assignment strategy, wherein the first task has a lower-priority than a second task of the plurality of tasks.
 2. The method of claim 1, wherein the first plurality of tasks comprises a number of tasks from a front of a queue of tasks.
 3. The method of claim 2, wherein the number of tasks is greater than one and less than ten.
 4. The method of claim 2, further comprising: determining, by the at least one computer processor, an optimal degree of choice for the task assignment strategy; and determining, by the at least one computer processor, the number of tasks based on the optimal degree of choice.
 5. The method of claim 2, wherein the number of tasks is proportional to a size of the queue of tasks.
 6. The method of claim 2, wherein the number of tasks is proportional to relative numbers of tasks of different priorities.
 7. The method of claim 1, further comprising: determining, by the at least one computer processor, that the first task of the plurality of tasks has exceeded a relevant service level agreement.
 8. The method of claim 7, wherein the service level agreement is a function of an estimated wait time for the first task.
 9. The method of claim 7, wherein the first plurality of tasks comprises a number of tasks from a front of a queue of tasks, and wherein the service level agreement is a function of the number of tasks.
 10. The method of claim 1, wherein at least one of the plurality of tasks is a virtual task.
 11. The method of claim 1, wherein the task assignment strategy is a behavioral pairing strategy.
 12. A system for behavioral pairing in a task assignment system comprising: at least one computer processor communicatively coupled to and configured to operate in the task assignment system, wherein the at least one computer processor is further configured to: determine a priority for each of a plurality of tasks; determine an agent available for assignment to any of the plurality of tasks; and assign a first task of the plurality of tasks to the agent using a task assignment strategy, wherein the first task has a lower-priority than a second task of the plurality of tasks.
 13. An article of manufacture for behavioral pairing in a task assignment system comprising: a non-transitory processor readable medium; and instructions stored on the medium; wherein the instructions are configured to be readable from the medium by at least one computer processor communicatively coupled to and configured to operate in the task assignment system and thereby cause the at least one computer processor to operate so as to: determine a priority for each of a plurality of tasks; determine an agent available for assignment to any of the plurality of tasks; and assign a first task of the plurality of tasks to the agent using a task assignment strategy, wherein the first task has a lower-priority than a second task of the plurality of tasks. 